minimax algorithm

минимаксный алгоритм

English-Russian dictionary of computer science. 2015.

Смотреть что такое "minimax algorithm" в других словарях:

  • Minimax — This article is about the decision theory concept. For other uses, see Minimax (disambiguation). Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a… …   Wikipedia

  • Minimax (disambiguation) — Minimax, minmax, or min max can refer to: Minimax, a strategy in decision theory and related disciplines concerned with minimizing the maximum possible loss Minimax (TV channel), a European children s TV channel Minimax (re branded Macro), a… …   Wikipedia

  • Minimax estimator — In statistical decision theory, where we are faced with the problem of estimating a deterministic parameter (vector) from observations an estimator (estimation rule) is called minimax if its maximal risk is minimal among all estimators of . In a… …   Wikipedia

  • Minimax approximation algorithm — Polynomial expansions such as the Taylor series expansion are often convenient for theoretical work but less useful for practical applications. For practical work it is often desirable to minimize the maximum absolute or relative error of a… …   Wikipedia

  • Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… …   Wikipedia

  • Remez algorithm — The Remez algorithm (sometimes also called Remes algorithm, Remez/Remes exchange algorithm), published by Evgeny Yakovlevich Remez in 1934 [E. Ya. Remez, Sur la détermination des polynômes d approximation de degré donnée , Comm. Soc. Math.… …   Wikipedia

  • Newell's algorithm — is a 3D computer graphics procedure for elimination of polygon cycles in the depth sorting required in hidden surface removal. It was proposed in 1972 by brothers Martin Newell and Dick Newell, and Tom Sancha, while all three were working at… …   Wikipedia

  • Alpha-beta pruning — is a search algorithm which seeks to reduce the number of nodes that are evaluated in the search tree by the minimax algorithm. It is a search with adversary algorithm used commonly for machine playing of two player games (Tic tac toe, Chess, Go …   Wikipedia

  • Negamax — search is a slightly variant formulation of minimax search that relies on the zero sum property of a two player game. An animated pedagogical example showing the plain negamax algorithm (that is, without alpha beta pruning). The person performing …   Wikipedia

  • List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …   Wikipedia

  • Computer chess — 1990s Pressure sensory chess computer with LCD screen Chess+ For the iPad …   Wikipedia

Книги

Другие книги по запросу «minimax algorithm» >>

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.